On-line Load Balancing for Related Machines
نویسندگان
چکیده
We consider the problem of schedulingpermanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio of for the deterministic version, and for its randomized variant, improving the previous competitive ratios of 8 and ! " # . We also prove lower bounds of $ on the competitive ratio of deterministic algorithms and % on the competitive ratio of randomized algorithms for this problem.
منابع مشابه
Online Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm
Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...
متن کاملLoad Balancing for Response Time
A centralized scheduler must assign tasks to servers, processing on-line a sequence of task arrivals and departures. Each task runs for an unknown length of time, but comes with a weight that measures resource utilization per unit time. The response time of a server is the sum of the weights of the tasks assigned to it. The goal is to minimize the maximum response time, i.e., load, of any serve...
متن کاملDynamic Load Balancing for Raytraced Volume Rendering on Distributed Memory Machines
We present a technique for adaptive load balancing for ray traced volume rendering on distributed memory machines using hierarchical representation of volume data. Our approach partitions the image onto processors while preserving scanline coherence. Volume data is assumed replicated on each processor since our focus in this paper is to characterize computation and communication requirements fo...
متن کاملOnline Load Balancing of Temporary Tasks
This paper considers the non-preemptive on-line load balancing problem where tasks have limited duration in time. Upon arrival, each task has to be immediately assigned to one of the machines, increasing the load on this machine for the duration of the task by an amount that depends on both the machine and the task. The goal is to minimize the maximum load. Azar, Broder and Karlin studied the u...
متن کاملScheduling Techniques for Packet Routing , Load Balancing and Disk
We consider three scheduling problems that arise in studies of packet routing, load balancing and disk scheduling. A fundamental problem in the design of packet-switched communication networks is to provide effective methods for resolving contention when many packets wish to cross a link. End-to-end packet delays should be low and queue sizes should be small. For an adversarial connectionless m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 35 شماره
صفحات -
تاریخ انتشار 1997